- graph closure
- вчт. замыкание графа
The New English-Russian Dictionary of Radio-electronics. F.V Lisovsky . 2005.
graph closure
Смотреть что такое "graph closure" в других словарях:
Closure with a twist — is a property of subsets of an algebraic structure. A subset Y of an algebraic structure X is said to exhibit closure with a twist if for every two elements there exists an automorphism ϕ of X and an element such that … Wikipedia
Closure problem — A Closure problem is a problem in graph theory for finding a set of vertices in a directed graph such that there are no edges from the set to the rest of the graph. More specifically, the minimum closure problem asks for a set of this type with… … Wikipedia
Graph embedding — In topological graph theory, an embedding of a graph G on a surface Sigma; is a representation of G on Sigma; in which points of Sigma; are associated to vertices and simple arcs (homeomorphic images of [0,1] ) are associated to edges in such a… … Wikipedia
Transitive closure — In mathematics, the transitive closure of a binary relation R on a set X is the smallest transitive relation on X that contains R .For example, if X is a set of airports and xRy means there is a direct flight from airport x to airport y , then… … Wikipedia
Directed acyclic graph — An example of a directed acyclic graph In mathematics and computer science, a directed acyclic graph (DAG i … Wikipedia
Distance-hereditary graph — A distance hereditary graph. In graph theoretic mathematics, a distance hereditary graph (also called a completely separable graph)[1] is a graph in which the distances in any connected induced subgraph are the same as they are in the original… … Wikipedia
Comparability graph — In graph theory, a comparability graph is an undirected graph that connects pairs of elements that are comparable to each other in a partial order. Comparability graphs have also been called transitively orientable graphs, partially orderable… … Wikipedia
Universal graph — In mathematics, a universal graph is an infinite graph that contains every finite (or at most countable) graph as an induced subgraph. A universal graph of this type was first constructed by R. Rado [cite journal author = Rado, R. title =… … Wikipedia
Dependency graph — In mathematics, computer science and digital electronics, a dependency graph is a directed graph representing dependencies of several objects towards each other. It is possible to derive an evaluation order or the absence of an evaluation order… … Wikipedia
Matroid — In combinatorics, a branch of mathematics, a matroid ( /ˈmeɪ … Wikipedia
Transitive reduction — In mathematics, the transitive reduction of a binary relation R on a set X is a minimal relation R on X such that the transitive closure of R is the same as the transitive closure of R . If the transitive closure of R is antisymmetric and finite … Wikipedia
